منابع مشابه
Compact symmetric spaces , triangular factorization , and Cayley coordinates Derek Habermas
Let U/K represent a connected, compact symmetric space, where θ is an involution of U that fixes K, φ : U/K → U is the geodesic Cartan embedding, and G is the complexification of U. We investigate the intersection, studied by Pickrell, of φ(U/K) with the Birkhoff decomposition of G corresponding to a θ-stable triangular, or LDU, factoriztion of Lie(G). When g ∈ φ(U/K) is generic, the factorizat...
متن کاملMultilinear-NC1 6= Multilinear-NC2
An arithmetic circuit or formula is multilinear if the polynomial computed at each of its wires is multilinear. We give an explicit example for a polynomial f(x1, ..., xn), with coefficients in {0, 1}, such that over any field: 1. f can be computed by a polynomial-size multilinear circuit of depth O(log n). 2. Any multilinear formula for f is of size nΩ(logn). This gives a super-polynomial gap ...
متن کاملCayley graphs - Cayley nets
It is, however, not clear how to choose the generators to produce special graphs. We know many topologies and their generators, but many more may be constructed in the future, having better properties (in terms of diameter, nodal degree and connectivity) than for instance the hypercube. I will present several graphs which connect rings using the generator g 1 and some additional generators.
متن کاملMultilinear classifiers
Tenenbuam and Freeman proposed bilinear classifiers as a tool to classify observations influenced by both the variable to classify (“content”) and a nuisance factor (“style”). In most real-world problem however, observations are influenced by a number of such factors. Gait identification is a typical such situation. To tackle their influence, it is natural to resort to multilinear or tensor dec...
متن کاملThe Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism property for combinatorial objects was introduced by L. Babai in 1977. Since then it has been intensively studied for binary relational structures: graphs, digraphs, colored graphs etc. In this paper we study this property for oriented Cayley maps. A Cayley map is a Cayley graph provided by a cyclic rotation of its connection set. If the underlying graph is connected, the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1991
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(08)80113-7